home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Celestin Apprentice 5
/
Apprentice-Release5.iso
/
Source Code
/
Libraries
/
Bitmap Libraries 2.0
/
Examples
/
Digraph
/
ReadMe
< prev
Wrap
Text File
|
1996-02-22
|
912b
|
34 lines
File ReadMe Copyright (C) 1996 by John R. Montbriand. All Rights Reserved.
Copyright (C) 1996 by John Montbriand. All Rights Reserved.
Distribute freely in areas where the laws of copyright apply.
Use at your own risk.
Do not distribute modified copies.
These various BitMap libraries and examples are for free!
See the accompanying file BitMap.txt for details.
What does this example do?
This example illustrates how bitmaps can be used for implementing
memory efficient adjacency matrices for use in graph search algorithms.
To use it, click on one vertex, and then another. Once you do this, the
program will calculate the shortest path between the two vertices
and display the path.
Building the 68k version:
make Digraph # generates commands to make a 68k version
Building the PowerPC version:
make FatDigraph # generates commands to make a fat version
end of file